Edge clique graphs and some classes of chordal graphsCERIOLI, Marcia R; SZWARCFITER, Jayme L.Discrete mathematics. 2002, Vol 242, Num 1-3, pp 31-39, issn 0012-365XArticle

Characterization and recognition of generalized clique-helly graphsDOURADO, Mitre C; PROTTI, Fabio; SZWARCFITER, Jayme L et al.Discrete applied mathematics. 2007, Vol 155, Num 18, pp 2435-2443, issn 0166-218X, 9 p.Article

Complexity aspects of generalized helly hypergraphsDOURADO, Mitre C; PROTTI, Fabio; SZWARCFITER, Jayme L et al.Information processing letters. 2006, Vol 99, Num 1, pp 13-18, issn 0020-0190, 6 p.Article

Faster recognition of clique-Helly and hereditary clique-Helly graphsMIN CHIH LIN; SZWARCFITER, Jayme L.Information processing letters. 2007, Vol 103, Num 1, pp 40-43, issn 0020-0190, 4 p.Article

The Helly property on subfamilies of limited sizeDOURADO, Mitre C; PROTTI, Fabio; SZWARCFITER, Jayme L et al.Information processing letters. 2005, Vol 93, Num 2, pp 53-56, issn 0020-0190, 4 p.Article

UNIT CIRCULAR-ARC GRAPH REPRESENTATIONS AND FEASIBLE CIRCULATIONSMIN CHIH LIN; SZWARCFITER, Jayme L.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 1, pp 409-423, issn 0895-4801, 15 p.Article

On extensions, linear extensions, upsets and downsets of ordered setsCORREA, Ricardo C; SZWARCFITER, Jayme L.Discrete mathematics. 2005, Vol 295, Num 1-3, pp 13-30, issn 0012-365X, 18 p.Article

Complexity results related to monophonic convexityDOURADO, Mitre C; PROTTI, Fábio; SZWARCFITER, Jayme L et al.Discrete applied mathematics. 2010, Vol 158, Num 12, pp 1268-1274, issn 0166-218X, 7 p.Conference Paper

The clique operator on circular-arc graphsLIN, Min Chih; SOULIGNAC, Francisco J; SZWARCFITER, Jayme L et al.Discrete applied mathematics. 2010, Vol 158, Num 12, pp 1259-1267, issn 0166-218X, 9 p.Conference Paper

On transitive orientations with restricted covering graphsDOBSON, Maria Patricia; GUTIERREZ, Marisa; HABIB, Michel et al.Information processing letters. 2007, Vol 101, Num 3, pp 119-125, issn 0020-0190, 7 p.Article

Characterizations and recognition of circular-arc graphs and subclasses: A surveyLIN, Min Chih; SZWARCFITER, Jayme L.Discrete mathematics. 2009, Vol 309, Num 18, pp 5618-5635, issn 0012-365X, 18 p.Article

Some remarks on the geodetic number of a graphDOURADO, Mitre C; PROTTI, Fábio; RAUTENBACH, Dieter et al.Discrete mathematics. 2010, Vol 310, Num 4, pp 832-837, issn 0012-365X, 6 p.Article

Traces from LAGOS'07. IV Latin American Algorithms, Graphs, and Optimization Symposium, Puerto Varas - 2007DURAN, Guillermo; LIEBLING, Thomas M; MATAMALA, Martín et al.Discrete applied mathematics. 2010, Vol 158, Num 12, issn 0166-218X, 170 p.Conference Proceedings

On balanced graphsBONOMO, Flavia; DURAN, Guillermo; MIN CHIH LIN et al.Mathematical programming. 2006, Vol 105, Num 2-3, pp 233-250, issn 0025-5610, 18 p.Article

Brazilian Symposium on Graphs, Algorithms and CombinatoricsREED, Bruce A; SONG, Siang W; SZWARCFITER, Jayme L et al.Discrete applied mathematics. 2004, Vol 141, Num 1-3, issn 0166-218X, 297 p.Conference Proceedings

ON THE HULL NUMBER OF TRIANGLE-FREE GRAPHSDOURADO, Mitre C; PROTTI, Fábio; RAUTENBACH, Dieter et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 4, pp 2163-2172, issn 0895-4801, 10 p.Article

Parity codesPINTO, Paulo E. D; PROTTI, Fabio; SZWARCFITER, Jayme L et al.Informatique théorique et applications (Imprimé). 2005, Vol 39, Num 1, pp 263-278, issn 0988-3754, 16 p.Article

Generating all forest extensions of a partially ordered setSZWARCFITER, Jayme L.Lecture notes in computer science. 2003, pp 132-139, issn 0302-9743, isbn 3-540-40176-8, 8 p.Conference Paper

On packing and covering polyhedra of consecutive ones circulant cluttersAGUILERA, Néstor E.Discrete applied mathematics. 2010, Vol 158, Num 12, pp 1343-1356, issn 0166-218X, 14 p.Conference Paper

Irreversible conversion of graphsCENTENO, Carmen C; DOURADO, Mitre C; DRAQUE PENSO, Lucia et al.Theoretical computer science. 2011, Vol 412, Num 29, pp 3693-3700, issn 0304-3975, 8 p.Article

Improved algorithms for recognizing p-Helly and hereditary p-Helly hypergraphsDOURADO, Mitre C; MIN CHIH LIN; PROTTI, Fabio et al.Information processing letters. 2008, Vol 108, Num 4, pp 247-250, issn 0020-0190, 4 p.Article

Characterizations and Linear Time Recognition of Helly Circular-Arc GraphsMIN CHIH LIN; SZWARCFITER, Jayme L.Lecture notes in computer science. 2006, pp 73-82, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

Exact enumeration of rooted 3-connected triangular maps on the projective planeZHICHENG GAO; JIANYU WANG.Discrete applied mathematics. 2004, Vol 141, Num 1-3, pp 149-159, issn 0166-218X, 11 p.Conference Paper

Trees with three leaves are (n + 1)-unavoidableCEROI, S; HAVET, F.Discrete applied mathematics. 2004, Vol 141, Num 1-3, pp 19-39, issn 0166-218X, 21 p.Conference Paper

Generating bicliques of a graph in lexicographic orderDIAS, Vania M. F; DE FIGUEIREDO, Celina M. H; SZWARCFITER, Jayme L et al.Theoretical computer science. 2005, Vol 337, Num 1-3, pp 240-248, issn 0304-3975, 9 p.Article